Monochromatic Edges in Complete Multipartite Hypergraphs
نویسندگان
چکیده
Consider the following problem. In a school with three classes containing n students each, given that their genders are unknown, find minimum possible number of triples same-gender students—not all which from same class. Muaengwaeng asked this question and conjectured scenario occurs when boys, girls half-and-half. paper, we solve many generalizations problem including has more than classes, replaced by groups larger sizes, different gender is other non-binary attributes.
منابع مشابه
Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
A cyclic q-partition of a hypergraph (V,E) is a partition of the edge set E of the form {F, F , F θ 2 , . . . , F θ q−1 } for some permutation θ of the vertex set V . Let Vn = {1, 2, . . . , n}. For a positive integer k, ( Vn k ) denotes the set of all k-subsets of Vn. For a nonempty subset K of Vn−1, we let K n denote the hypergraph ( Vn, ⋃ k∈K ( Vn k )) . In this paper, we find a necessary an...
متن کاملPartitioning complete multipartite graphs by monochromatic trees
The tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t2(K(n1, n2, . . . , nk)) of the complete k-partite graph K(n1, n2, . . . , nk). In particular, we prove that t2(K(n,m)) = (m − 2)/2n + 2, whe...
متن کاملMonochromatic Tree Partition for Complete Multipartite Graphs
An r-edge-coloring of a graph G is a surjective assignment of r colors to the edges of G. The monochromatic tree partition number of an redge-colored graph G is defined to be the minimum positive integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In this paper, we give a direct proof for the m...
متن کاملCovering complete partite hypergraphs by monochromatic components
A well-known special case of a conjecture attributed to Ryser (actually appeared in the thesis of Henderson [7]) states that k-partite intersecting hypergraphs have transversals of at most k−1 vertices. An equivalent form of the conjecture in terms of coloring of complete graphs is formulated in [1]: if the edges of a complete graph K are colored with k colors then the vertex set of K can be co...
متن کاملHigh Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k. This implies that there are sparse hypergraphs such that in any coloring of their vertices with at most k − 1 colors there is a monochromatic hyperedge. We show that for any integers r, g ≥ 2 there is an r-uniform hypergraph of gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10132353